Complexity of Horn Description Logics
نویسندگان
چکیده
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn-DLs. While the combined complexity for many Horn-DLs turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning.
منابع مشابه
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data complexity of the instance checking problem is coNP-complete even for Horn knowledge bases in the basic description logic ALC. In this paper, we present and study weakenings with PTime data complexity of the instance checking pr...
متن کاملCombining description logics and Horn rules with uncertainty in ARTIGENCE
We present ARTIGENCE, a representation language that combines description logics and Horn rules with uncertainty. ARTIGENCE capabilities go beyond the similar hybrid systems presently available, and it contains three components: a highly expressive description logic ACLNR, a set of probabilistic Horn rules and a set of ground facts. The new features described, often required in realistic applic...
متن کاملComplexity Boundaries for Horn Description Logics
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reasoning has hardly been addressed so far. In thi...
متن کاملQuery Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
The high computational complexity of the expressive Description Logics (DLs) that underlie the OWL standard has motivated the study of their Horn fragments, which are usually tractable in data complexity and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms for answering conjunctive 2-way regular path queries (2CRPQs), a nontrivial ge...
متن کاملData Complexity of Reasoning in Very Expressive Description Logics
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of the ABox only. We show that, even for the very expressive DL SHIQ, satisfiability checking is data complete for NP. For applications with large ABoxes, this can be a more accurate estimate than the usually considered combined complexity, which is EXPTIMEcomplete. Fu...
متن کامل